Array Pattern Synthesis With Excitation Control via Norm Minimization
نویسندگان
چکیده
منابع مشابه
Array Pattern Control and Synthesis
Antenna array distributions and their associated patterns are now designed on physical principles, based on placement of zeros of the array polynomial. An overview of the synthesis processes is given. Robust and low Q distributions for linear arrays and circular planar arrays, that provide variable side lobe level pencil beam patterns, are treated in detail. Associated difference patterns are i...
متن کاملAntenna array pattern synthesis via convex optimization
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great eeciency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far and near eld patterns over narrow or broad frequency bandwidth, and some i...
متن کاملControl Using Atomic Norm Minimization
It has been shown that the H2 distributed control problem subject to quadratically invariant delay constraints admits a finite dimensional solution. When these delay constraints are induced by a strongly connected communication graph, this problem can be solved by decomposing the controller into a centralized but delayed component, and a distributed finite impulse response component, the latter...
متن کاملNuclear Norm Minimization via Active Subspace Selection
We describe a novel approach to optimizing matrix problems involving nuclear norm regularization and apply it to the matrix completion problem. We combine methods from non-smooth and smooth optimization. At each step we use the proximal gradient to select an active subspace. We then find a smooth, convex relaxation of the smaller subspace problems and solve these using second order methods. We ...
متن کاملOn Tensor Completion via Nuclear Norm Minimization
Many problems can be formulated as recovering a low-rank tensor. Although an increasingly common task, tensor recovery remains a challenging problem because of the delicacy associated with the decomposition of higher order tensors. To overcome these difficulties, existing approaches often proceed by unfolding tensors into matrices and then apply techniques for matrix completion. We show here th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Antennas and Propagation
سال: 2016
ISSN: 0018-926X,1558-2221
DOI: 10.1109/tap.2016.2594300